For a finite group G let Gamma(G) denote the graph defined on the non-identity elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G. We look for conditions on the positive integer in that ensure that Gamma(G) contains a Hamiltonian cycle when G is the wreath product of a finite simple group S and a cyclic group of order m.
展开▼
